Quadratic minimisation problems in statistics

نویسندگان

  • Casper J. Albers
  • Frank Critchley
  • John C. Gower
چکیده

We consider the problem minx(x−t)′A(x−t) subject to x′Bx+2b′x = k where A is positive definite or positive semidefinite. Commonly occurring statistical variants of this problem are discussed within the framework of a general unifying methodology. These include non-trivial considerations that arise when (i) A and/or B are not of full rank and (ii) t takes special forms (especially t = 0 which, under further conditions, reduces to the well-known two-sided eigenvalue solution). Special emphasis is placed on insights provided by geometrical interpretations. Algorithmic considerations are discussed and examples given.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Extensions of quadratic minimisation theory: the discrete-time case

A covariance condition is shown to be a necessary condition for the existence of a finite control law associated with discrete-time quadratic loss-minimisation problems. Sufficient conditions (including the covariance condition) are then determined which extend the range of optimal-control problems, for which a well defined control law may be calculated. The results may also be applied to solvi...

متن کامل

Explicit minimisation of a convex quadratic under a general quadratic constraint 9 July 2007

An analytical solution is provided to the problem of minimising a convex quadratic under a general quadratic (inequality) constraint, additional affine constraints being easily accommodated. Such problems occur widely. The explicit, analytical solution provided offers insight into the diverse nature both of special cases of this problem and of their solution sets. This sheds light on algorithm ...

متن کامل

Structural Risk Minimisation based gene expression profiling analysis

For microarray based cancer classification, feature selection is a common method for improving classifier generalisation. Most wrapper methods use cross validation methods to evaluate feature sets. For small sample problems like microarray, however, cross validation methods may overfit the data. In this paper, we propose a Structural Risk Minimisation (SRM) based method for gene selection in ca...

متن کامل

Shortfall Risk Minimisation vs. Symmetric (Quadratic) Hedging

The seller of a contingent claim H can always find a self-financing investment strategy that (super)hedges the claim H. When the seller wants to endow an initial capital x less than the one required to get perfect (super)hedging, the shortfall risk minimisation problem arises in a natural way. The aim is to find the strategy that minimises E{`([H(ST )−V x,φ T ])} (shortfall risk), where V x,φ t...

متن کامل

Sharp quadratic majorization in one dimension

Majorization methods solve minimization problems by replacing a complicated problem by a sequence of simpler problems. Solving the sequence of simple optimization problems guarantees convergence to a solution of the complicated original problem. Convergence is guaranteed by requiring that the approximating functions majorize the original function at the current solution. The leading examples of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Multivariate Analysis

دوره 102  شماره 

صفحات  -

تاریخ انتشار 2011